A fine-grained parallelization of the immersed boundary method

We present new algorithms for the parallelization of Eulerian–Lagrangian interaction operations in immersed boundary method. Our rely on two well-studied parallel primitives: key-value sort and segmented reduce. The use these primitives allows us to implement our both graphics processing units (GPUs) other shared-memory architectures. strong weak scaling tests problems involving scattered points elastic structures. show that exhibit near-ideal multicore CPUs GPUs.